The Min-max Edge q-Coloring Problem
نویسندگان
چکیده
In this paper we introduce and study a new problem named min-max edge q-coloring which is motivated by applications in wireless mesh networks. The input of the problem consists of an undirected graph and an integer q. The goal is to color the edges of the graph with as many colors as possible such that: (a) any vertex is incident to at most q different colors, and (b) the maximum size of a color group (i.e. set of edges identically colored) is minimized. We show the following results:
منابع مشابه
Local search algorithms for wireless mesh networks
Abstract. In a multi-channel Wireless Mesh Networks (WMN), each node is able to use multiple non-overlapping frequency channels. Raniwala et al. (Mobile Computing and Communications Review 2004, INFOCOM 2005) propose and study several such architectures in which a computer can have multiple network interface cards. These architectures are modeled as a graph problem named maximum edge q-coloring...
متن کاملThe maximum edge q-coloring problem
We consider the problem of coloring edges of a graph subject to the following constraints: for every vertex v, all the edges incident with v have to be colored with at most q colors. The goal is to find a coloring satisfying the above constraints and using the maximum number of colors. Notice that the notion of coloring is different than in the classical edge coloring problem, as neighboring ed...
متن کاملBounded Max-colorings of Graphs
In a bounded max-coloring of a vertex/edge weighted graph, each color class is of cardinality at most b and of weight equal to the weight of the heaviest vertex/edge in this class. The bounded max-vertex/edge-coloring problems ask for such a coloring minimizing the sum of all color classes’ weights. In this paper we present complexity results and approximation algorithms for those problems on g...
متن کاملOn the Complexity of the Max-Edge-Coloring Problem with Its Variant
The max-edge-coloring problem (MECP) is finding an edge colorings {E1, E2, E3, ..., Ez} of a weighted graph G=(V, E) to minimize { } ∑ = ∈ z i i k k E e e w 1 ) ( max , where w(ek) is the weight of ek. In the work, we discuss the complexity issues on the new graph problem and its variants. Specifically, we design a 2-approximmation algorithm for the max-edge-coloring problem on biplanar graphs....
متن کاملComparing First-Fit and Next-Fit for Online Edge Coloring
We study the performance of the algorithms First-Fit and Next-Fit for two online edge coloring problems. In the min-coloring problem, all edges must be colored using as few colors as possible. In the max-coloring problem, a fixed number of colors is given, and as many edges as possible should be colored. Previous analysis using the competitive ratio has not separated the performance of First-Fi...
متن کامل